The Combinatorialization of Linear Recurrences
نویسندگان
چکیده
We provide two combinatorial proofs that linear recurrences with constant coefficients have a closed form based on the roots of its characteristic equation. The proofs employ sign-reversing involutions on weighted tilings.
منابع مشابه
Diophantine Equations Related with Linear Binary Recurrences
In this paper we find all solutions of four kinds of the Diophantine equations begin{equation*} ~x^{2}pm V_{t}xy-y^{2}pm x=0text{ and}~x^{2}pm V_{t}xy-y^{2}pm y=0, end{equation*}% for an odd number $t$, and, begin{equation*} ~x^{2}pm V_{t}xy+y^{2}-x=0text{ and}text{ }x^{2}pm V_{t}xy+y^{2}-y=0, end{equation*}% for an even number $t$, where $V_{n}$ is a generalized Lucas number. This pape...
متن کاملSimultaneous modeling of multiple recurrences in breast cancer patients
Introduction: Breast cancer is one of the most common recurrence cancers among women. There are several factors that can affect multiple recurrence of this disease. On the other hand, simultaneous examination of the types of relapses will make the results more accurate. The purpose of this study was to use a joint frailty model to model multiple recurrences of breast cancer patients. Materials ...
متن کاملGenerating Matrices for Weighted Sums of Second Order Linear Recurrences
In this paper, we give fourth order recurrences and generating matrices for the weighted sums of second order recurrences. We derive by matrix methods some new explicit formulas and combinatorial representations, and some relationships between the permanents of certain superdiagonal matrices and these sums.
متن کاملConstruction of Equidistributed Generators Based on Linear Recurrences Modulo 2
Random number generators based on linear recurrences modulo 2 are widely used and appear in different forms, such as the simple and combined Tausworthe generators, the GFSR, and the twisted GFSR generators. Low-discrepancy point sets for quasi-Monte Carlo integration can also be constructed based on these linear recurrences. The quality of these generators or point sets is usually measured by c...
متن کاملLinear Recurrences through Tilings and Markov Chains
We present a tiling interpretation for kth order linear recurrences, which yields new combinatorial proofs for recurrence identities. Moreover, viewing the tiling process as a Markov chain also yields closed form Binet-like expressions for these recurrences.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 18 شماره
صفحات -
تاریخ انتشار 2011